An Extension of the Multi-machine Multi-level Proportional Lot Sizing and Scheduling Model for Product-Life-Cycle Demand

نویسندگان

  • Ping-Teng Chang
  • Ching-Hsiang Chang
  • Chia-Tsung Chen
چکیده

Often lot sizing and scheduling models have neglected the consideration of influence of product life cycles (PLCs). But, accordingly as desirable in a firm’s production strategy, decisions of lot sizing scheduling may have to respond to the stage changes in a product’s life cycle. In this paper, we propose an extension of the lot sizing scheduling, the multi-item, multi-level product-structure and multi-machine proportional lot sizing scheduling model by Kimms (1999), by the concept of PLC. The advantages have been realized and include both the setup and holding cost improvements and an improved lot sizing scheduling that better matches the products’ demands in the PLCs. In addition, the combined effects of the setup (cost) learning effect and cash flow are examined in the model and the genetic algorithm is adopted as the solution aid tool. A numerical example is provided and demonstrates the advantages of this model and the effects of the factors considered. KeywordsProportional lot sizing and scheduling problem; Product life cycle; Cash flow, Learning curve; Genetic algorithms * Corresponding author, email: [email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Finite Horizon Economic Lot Scheduling in Flexible Flow Lines

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

متن کامل

Lot sizing with rework and different inspection costs

This paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. We have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. Further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

متن کامل

Optimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

متن کامل

A Multi-objective Mathematical Model for Sustainable Supplier Selection and Order Lot-Sizing under Inflation

Recently, scholars and practitioners have shown an increased interest in the field of sustainable supplier selection and order lot-sizing. While several studies have recently carried out on this field, far too little attention has been given to formulating a multi-objective model for the integrated problem of multi-period multi-product order lot-sizing and sustainable supplier selection under i...

متن کامل

Three Metaheuristic Algorithms for Solving the Multi-item Capacitated Lot-sizing Problem with Product Returns and Remanufacturing

This paper proposes a new mixed integer programming model for multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages in closed-loop supply chains. The returned products from customers can either be disposed or be remanufactured to be sold as new ones again. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA) al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004